Algorithms to compute the topological Euler characteristic, Chern-Schwartz-MacPherson class and Segre class of projective varieties

نویسنده

  • Martin Helmer
چکیده

Let V be a closed subscheme of a projective space P. We give an algorithm to compute the Chern-Schwartz-MacPherson class, and the Euler characteristic of V and an algorithm to compute the Segre class of V . The algorithms can be implemented using either symbolic or numerical methods. The algorithms are based on a new method for calculating the projective degrees of a rational map defined by a homogeneous ideal. Relationships between the algorithms developed here and other existing algorithms are discussed. The algorithms are tested on several examples and are found to perform favourably compared to current algorithms for computing Chern-Schwartz-MacPherson classes, Segre classes and Euler characteristics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing characteristic classes of subschemes of smooth toric varieties

Let XΣ be a complete smooth toric variety of dimension n defined by a fan Σ where all Cartier divisors in Pic(XΣ) are nef and let V be a subscheme of XΣ. We show a new expression for the Segre class s(V,XΣ) in terms of the projective degrees of a rational map associated to V . In the case where the number of primitive collections of rays in the fan Σ is equal to the number of generating rays in...

متن کامل

A direct algorithm to compute the topological Euler characteristic and Chern-Schwartz-MacPherson class of projective complete intersection varieties

Let V be a possibly singular scheme-theoretic complete intersection subscheme of P over an algebraically closed field of characteristic zero. Using a recent result of Fullwood (“On Milnor classes via invariants of singular subschemes”, Journal of Singularities) we develop an algorithm to compute the Chern-Schwartz-MacPherson class and Euler characteristic of V . This algorithm complements exist...

متن کامل

The Euclidean Distance Degree of Smooth Complex Projective Varieties

We obtain several formulas for the Euclidean distance degree (ED degree) of an arbitrary nonsingular variety in projective space: in terms of Chern and Segre classes, Milnor classes, Chern-Schwartz-MacPherson classes, and an extremely simple formula equating the Euclidean distance degree of X with the Euler characteristic of an open subset of X.

متن کامل

Euler Characteristics of General Linear Sections and Polynomial Chern Classes

We obtain a precise relation between the Chern-Schwartz-MacPherson class of a subvariety of projective space and the Euler characteristics of its general linear sections. In the case of a hypersurface, this leads to simple proofs of formulas of Dimca-Papadima and Huh for the degrees of the polar map of a homogeneous polynomial, extending these formula to any algebraically closed field of charac...

متن کامل

Chern classes and Characteristic Cycles of Determinantal Varieties

Let K be an algebraically closed field of characteristic 0. For m ≥ n, we define τm,n,k to be the set of m× n matrices over K with kernel dimension ≥ k. This is a projective subvariety of Pmn−1, and is called the (generic) determinantal variety. In most cases τm,n,k is singular with singular locus τm,n,k+1. In this paper we give explicit formulas computing the Chern-Mather class (cM ) and the C...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 73  شماره 

صفحات  -

تاریخ انتشار 2016